THERE IS NO FINITE-VARIABLE EQUATIONAL AXIOMATIZATION OF REPRESENTABLE RELATION ALGEBRAS OVER WEAKLY REPRESENTABLE RELATION ALGEBRAS
نویسندگان
چکیده
منابع مشابه
Completely Representable Relation Algebras
A boolean algebra is shown to be completely representable if and only if it is atomic whereas it is shown that the class of completely representable relation algebras is not elementary.
متن کاملOn canonicity and completions of weakly representable relation algebras
We show that the variety of weakly representable relation algebras is not canonical, nor closed under Monk completions. §
متن کاملStrongly Representable Atom Structures of Relation Algebras
A relation algebra atom structure α is said to be strongly representable if all atomic relation algebras with that atom structure are representable. This is equivalent to saying that the complex algebra Cmα is a representable relation algebra. We show that the class of all strongly representable relation algebra atom structures is not closed under ultraproducts and is therefore not elementary. ...
متن کاملOn the Equational Theory of Representable Polyadic Equality Algebras
Among others we will see that the equational theory of ! dimensional rep-resentable polyadic equality algebras (RPEA ! 's) is not schema axiomatizable. This result is in interesting contrast with the Daigneault-Monk representation theorem, which states that the class of representable polyadic algebras is nite schema-axiomatizable (and hence the equational theory of this class is nite schema-axi...
متن کاملFinite Algebras of Relations Are Representable on Finite Sets
Using a combinatorial theorem of Herwig on extending partial isomorphisms of relational structures, we give a simple proof that certain classes of algebras, including Crs, polyadic Crs, and WA, have thè`nite base property' and have decidable universal theories, and that any nite algebra in each class is representable on a nite set.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Review of Symbolic Logic
سال: 2016
ISSN: 1755-0203,1755-0211
DOI: 10.1017/s1755020316000265